Constraint Conjunction versus Grounded Constraint Subhierarchies in Optimality Theory
نویسنده
چکیده
A central assumption of classical Optimality Theory (Prince and Smolensky 1993) is that constraint domination is strict. That is, if constraint A outranks constraints B and C (A >> B, C), then a candidate output that violates A can never be favored over one that satisfies A but violates B and/or C, no matter how many violations of B and C occur. Tableau (1) illustrates the familiar scenario of strict domination: though candidate (1)a has more constraint violations than (1)b, it wins.
منابع مشابه
On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملUsing Local Constraint Conjunction to Discover Constraints: the Case of Mandarin Chinese*
This paper, inspired by the collection of papers in Wang & Smith (1997), discusses a restriction in synchronic Mandarin Chinese which involves voiced stops, rising tone and nasal codas. The paper argues that this restriction can be described only as the result of the combined action of two constraints, i.e. a ‘local constraint conjunction’. We discuss the exact formulation of this conjunction a...
متن کاملOptionality and Gradience in Persian Phonology: An Optimality Treatment
The distribution of the allophones of /?/in certain contexts involves free variation and gradient preferences. An organized survey was conducted to elicit the judgments of 37 native Persian speakers concerning the well-formedness of /?/allophonic behavior in five different phonological positions. The results showed that the differences in judgment between the various categories are not just t...
متن کاملThree Formal Extensions to Primitive Optimality Theory
This paper proposes an expansion of set of primitive constraints available within the Primitive Optimality Theory framework (Eisner, 1997a). This expansion consists of the addition of a new family of constraints—existential implicational constraints, which allow the specification of faithfulness constraints that can be satisfied at a distance—and the definition of two ways to combine simple con...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001